CPU Resource Scheduling in Programmable Networks
نویسندگان
چکیده
Programmable network paradigm allows packet processing in the routers within the data path. One of the key problems in programmable networks is the inability to determine execution times of packets from information in headers for scheduling which is in contrast to using packet length in transport resources scheduling. This paper presents a scheduling algorithm called Prediction based Fair Queueing (PBFQ) which uses prediction algorithm to estimate CPU requirements of packet and according to that it then schedules the CPU resource adaptively, fairly and efficiently among all the competing flows. The effectiveness of this algorithm is shown through simulation work.
منابع مشابه
Fair Resource Allocation in Programmable and Active Networks Using a Composite Scheduler
In active and programmable networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to bandwidth to achieve overall fairness. Maintaining fairness of one resource allocation does not ensure the fair allocation of other resources automatically. The dynamic nature of network load, and the inherent unpredictability of processing times of active ...
متن کاملProcessing resource scheduling in programmable networks
Programmable network paradigm allows the execution of active applications in routers or switches to provide more flexibility to traditional networks, and richer services for users. In this paper, we discuss issues in designing resource schedulers for processing engines in programmable networks. One of the key problems in programmable networks is the inability to determine execution times of pac...
متن کاملAn Efficient Resource Management Framework for Programmable and Active Networks
This report presents a framework for resource management in highly dynamic active and programmable networks. The goal is to allocate and manage node resources in an efficient way while ensuring effective utilization of network and supporting load balancing. The framework supports coexistence of active and non-active nodes and proposes a novel Directory Service (DS) architecture that can be used...
متن کاملScheduling Resources in Programmable and Active Networks Based on Adaptive Estimations
In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to the bandwidth to improve overall performance. The inherent unpredictability of processing times of active packets poses a signifi...
متن کاملDesign and Performance Analysis of CBCS Packet Scheduling Algorithm
In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to the bandwidth to improve overall performance. The dynamic nature of network load and the inherent unpredictability of processing ...
متن کامل